Integral approximation by kernel smoothing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integral approximation by kernel smoothing

where f̂ is the classical kernel estimator of the density of X1. This result is striking because it speeds up traditional rates, in root n, derived from the central limit theorem when f̂ = f . Although this paper highlights some applications, we mainly address theoretical issues related to the later result. We derive upper bounds for the rate of convergence in probability. These bounds depend on ...

متن کامل

Quick Kernel Ball Region Approximation for Improved Laplace Smoothing

Instead of using the polygon defined by adjacent vertices to a vertex (called the ball) or its kernel [1], we propose a modified polygon that is easy to compute, convex and an approximation of the kernel. We call this polygon the “quick kernel ball region.” This novel algorithm is presented in details. It is easy to implement and effective in constraining a vertex to remain within its feasible ...

متن کامل

Degenerate kernel approximation method for solving Hammerstein system of Fredholm integral equations of the second kind

Degenerate kernel approximation method is generalized to solve Hammerstein system of Fredholm integral equations of the second kind. This method approximates the system of integral equations by constructing degenerate kernel approximations and then the problem is reduced to the solution of a system of algebraic equations. Convergence analysis is investigated and on some test problems, the propo...

متن کامل

Multistep kernel regression smoothing by boosting

In this paper we propose a simple multistep regression smoother which is constructed in a boosting fashion, by learning the Nadaraya–Watson estimator with L2Boosting. Differently from the usual approach, we do not focus on L2Boosting for ever. Given a kernel smoother as a learner, we explore the boosting capability to build estimators using a finite number of boosting iterations. This approach ...

متن کامل

Gaussian Kernel Smoothing

where K is the kernel of the integral. Given the input signal X , Y represents the output signal. The smoothness of the output depends on the smoothness of the kernel. We assume the kernel to be unimodal and isotropic. When the kernel is isotropic, it has radial symmetry and should be invariant under rotation. So it has the form K(t, s) = f(‖t− s‖) for some smooth function f . Since the kernel ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bernoulli

سال: 2016

ISSN: 1350-7265

DOI: 10.3150/15-bej725